Calculus on Graphs

نویسندگان

  • Joel Friedman
  • Jean-Pierre Tillich
چکیده

The purpose of this paper is to develop a “calculus” on graphs that allows graph theory to have new connections to analysis. For example, our framework gives rise to many new partial differential equations on graphs, most notably a new (Laplacian based) wave equation (see [FTa, FTc]); this wave equation gives rise to a partial improvement on the Chung-Faber-Manteuffel diameter/eigenvalue bound in graph theory (see [CFM94]), and the Chung-Grigoryan-Yau and (in a certain case) Bobkov-Ledoux distance/eigenvalue bounds in analysis (see [CGY96, CGY97, BL97]). Our framework also allows most techniques for the non-linear p-Laplacian in analysis to be easily carried over to graph theory (see [FTb]).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On P-transitive graphs and applications

We introduce a new class of graphs which we call P-transitive graphs, lying between transitive and 3-transitive graphs. First we show that the analogue of de Jongh-Sambin Theorem is false for wellfounded P-transitive graphs; then we show that the μ-calculus fixpoint hierarchy is infinite for Ptransitive graphs. Both results contrast with the case of transitive graphs. We give also an undecidabi...

متن کامل

On modal mu-calculus in S5 and applications

We show that the vectorial μ-calculus model checking problem over arbitrary graphs reduces to the vectorial, existential μ-calculus model checking problem over S5 graphs. We also draw some consequences of this fact. Moreover, we give a proof that satisfiability of μ-calculus in S5 is NP -complete, and by using S5 graphs we give a new proof that the satisfiability problem of the existential μ-ca...

متن کامل

Fabio Fioravanti ( Ed . ) CILC 2011 26 th Italian Conference on Computational Logic

We show that the vectorial μ-calculus model checking problem over arbitrary graphs reduces to the vectorial, existential μ-calculus model checking problem over S5 graphs. We also draw some consequences of this fact. Moreover, we give a proof that satisfiability of μ-calculus in S5 is NP -complete, and by using S5 graphs we give a new proof that the satisfiability problem of the existential μ-ca...

متن کامل

Differential Calculus on Cayley Graphs

We conservatively extend classical elementary differential calculus to the Cartesian closed category of convergence spaces. By specializing results about the convergence space representation of directed graphs, we use Cayley graphs to obtain a differential calculus on groups, from which we then extract a Boolean differential calculus, in which both linearity and the product rule, also called th...

متن کامل

On certain fractional calculus operators involving generalized Mittag-Leffler function

The object of this paper is to establish certain generalized fractional integration and differentiation involving generalized Mittag-Leffler function defined by Salim and Faraj [25]. The considered generalized fractional calculus operators contain the Appell's function $F_3$ [2, p.224] as kernel and are introduced by Saigo and Maeda [23]. The Marichev-Saigo-Maeda fractional calculus operators a...

متن کامل

Some Notes on Proofs with Alpha Graphs

It is well-known that Peirce’s Alpha graphs correspond to propositional logic (PL). Nonetheless, Peirce’s calculus for Alpha graphs differs to a large extent to the common calculi for PL. In this paper, some aspects of Peirce’s calculus are exploited. First of all, it is shown that the erasure-rule of Peirce’s calculus, which is the only rule which does not enjoy the finite choice property, is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره cs.DM/0408028  شماره 

صفحات  -

تاریخ انتشار 2004